Description: 在数据库中发现频繁模式和关联规则是数据挖掘领域的最基本、最重要的问题。大多数早期的研究采用了类似Apriori算法的产生候选级并测试迭代的途径代价是昂贵的，尤其是挖掘富模式和长模式时，Jiawei Han提出了一种新颖的数据结构FP_tree,及基于其上的FP_growth算法，主要用于有效的进行长模式与富模式的挖掘.本文在讨论了FP_growth算法的基础上，提出了用Visual C++实现该算法的方法，并编写了算法的程序。-found in the database model and the frequent association rules is the area of data mining the most fundamental and important issues. Most of the early studies used a similar Apriori algorithm for the selection of candidates and test-iterative way was costly, particularly mining the rich patterns and long model, Jiawei Han proposed a novel data structure FP_tree and on the basis of their FP_growth algorithm used effectively the model for long and rich patterns of excavation. This paper discussed the FP_growth algorithm on the basis of the Visual C of the algorithm, and the preparation procedure of the algorithm. Platform: |
Size: 10537 |
Author:hq |
Hits:
Description: 本书较为系统和全面地介绍了算法学最基本的知识。这些知识和技巧既是高等院校“算法与数据结构”课程的主要内容，也是国际青少年信息学奥林匹克（IOI）竞赛和ACM/ICPC国际大学生程序设计竞赛中所需要的。书中分析了相当数量的问题。
-the book is more systematic and comprehensive study of the algorithm fundamental knowledge. These knowledge and skills is not only institutions of higher learning "algorithms and data structures," The main elements of the program. international youth Olympic Informatics (IOI) and the ACM contest / ICPC International Collegiate Programming competition Competition needs. The book analyzes the considerable number of problems. Platform: |
Size: 13869977 |
Author:px |
Hits:
Description: 本文主要阐述了DTMF的原理及如何在MATLAB上产生DTMF信号，主要涉及到电话拨号音合成的基本原理及识别的主要方法，利用 MATLAB 软件以及 FFT 算法实现对电话通信系统中拨号音的合成与识别。并进一步利用 MATLAB 中的图形用户界面 GUI 制作简单直观的模拟界面。 能够利用矩阵不同的基频合成 0 － 9 不同按键的拨号音，并能够对不同的拨号音加以正确的识别，实现由拨号音解析出电话号码的过程，完成对电话拨号音系统的简单的实验仿真。-This paper described the principle and how DTMF in MATLAB to generate DTMF signals, mainly related to the telephone dial tone of the basic principles of synthesis and identification of the main methods, the use of MATLAB software and the FFT algorithm on the telephone communication system dial tone Synthesis and Recognition . And further the use of MATLAB in the production of graphical user interface simple and intuitive GUI interface simulation. Able to take advantage of matrix synthesis of different fundamental frequency 0- 9 different keys of the dial tone and be able to different dial tone to be the correct identification, the dial tone from a telephone number to resolve the process of completion of the telephone dial tone system, a simple experiment simulation. Platform: |
Size: 4096 |
Author:冯扬 |
Hits:
Description: 单链表的基本操作,包括创建,插入,删除,
是数据结构中的一个基本算法 -Single list of basic operations, including the creation, insert, delete, data structure is a fundamental algorithm Platform: |
Size: 1024 |
Author:李明 |
Hits:
Description: 图像分割是图像处理最基本和最重要的技术，是任何理解系统和自动识别系统
必不可少的一个重要环节.车牌以及车牌字符的提取是图像分割技术的一个特殊应
用场合，它包括车牌的定位和车牌字符的切分两个步骤。本章将对这两个步骤的算
法进行阐述.第一、二节中将分别详细介绍车牌区域的定位、切分技术 由于二值
化算法在字符的提取中具有重要的作用，因此在第三节中将作重点讨论.
-Image processing image segmentation is the most fundamental and important technology, is any understanding of systems and automatic identification system essential for an important part. License plate and license plate character extraction image segmentation technique is a special application, which includes car license plate location and character segmentation in two steps. These two steps in this chapter will elaborate algorithm. First, the two plates will introduce a detailed regional positioning, segmentation techniques as a result of binarization algorithm in the extraction of characters play an important role, so in Section III will be focused on. Platform: |
Size: 6277120 |
Author:poon |
Hits:
Description: 数据结构最基本最经典的问题，关于树的一些主要算法！-Data structure the most fundamental and most classic problem, with regard to some of the main algorithm for the tree! Platform: |
Size: 21504 |
Author:鱼 |
Hits:
Description: 线性同余算法产生随机数 及其应用的源码
线性同余算法是产生随机数的最基本也是最常用的算法-Linear congruence generated random number algorithm and its application source linear congruence algorithm is randomly generated number of the most fundamental and commonly used algorithm Platform: |
Size: 256000 |
Author:cuiyuzheng |
Hits:
Description: 这个是用基本粒子群优化算法解两个测试函数的最小值问题。-This is a fundamental particle swarm optimization algorithm using two test function solution of the minimum problem. Platform: |
Size: 1024 |
Author:chenyanhai |
Hits:
Description: 监听输入音频并利用FFT算法计算出其频谱-This article shows how to use a Fast Fourier Transform (FFT) algorithm to calculate the fundamental frequency of a captured audio sound. Platform: |
Size: 121856 |
Author:王明远 |
Hits:
Description: 一个比较基本的人工智能对话程序，Ｃ编写，里面所用的算法比较典型-A more fundamental process of dialogue in artificial intelligence, C preparation, which the algorithm used in a typical Platform: |
Size: 53248 |
Author:张宏欣 |
Hits:
Description: 基于分频带自相关函数的混叠语音基频分离提取新算法
-Based on the sub-band auto-correlation function of the fundamental frequency of voice-alias A New Algorithm for Extraction Platform: |
Size: 172032 |
Author:irenezhu |
Hits:
Description: 小型计算器，基于栈结构的算法设计，模拟windows的计算器，支持正负数的四则运算-A small calculator, based on the stack structure, algorithm design, simulation windows calculator, support the four fundamental operations of plus or minus a few Platform: |
Size: 46080 |
Author: Kevin Lee |
Hits:
Description: 用遗传算法解根号2，求根号2，也就是求方程f(x)=x*x-2=0的正整数解，x=1时f(1)<0，x=2时f(2)>0，由介值定理，则1到2中间存在一个根，根据代数基本定理和根的对称性知这就是我们要找的根（废话，初中生都知道是1.414左右），由目标函数得到适应度函数，我们选择个体都在[1,2]之间，那适应度函数我可以取
j(x)=40/(2+|x*x-2|)-10，由x的取值范围知j的范围是(0,10)
x和y交叉就用取平均(x+y)/2，交叉概率取0.9，变异概率为0，-Using genetic algorithm for solving square root of 2, Roots, No. 2, that is, of equation f (x) = x* x-2 = 0 the positive integer solution, x = 1 Shi f (1) < 0, x = 2 Shi f (2) " 0, by the intermediate value theorem, then there is a 1-2 middle of the root, according to the fundamental theorem of algebra and the symmetry of the root to know that is what we are looking for the root (nonsense, junior high school students all know that 1.414 or so), from the target function to fitness function, we have chosen to individuals are in [1,2] between the fitness function that I can take j (x) = 40/(2+ | x* x-2 |)-10, from the x' s j known range of the range is (0,10) x and y cross on the use of taking the average (x+ y)/2, taking 0.9 crossover probability, mutation probability of 0, Platform: |
Size: 3072 |
Author:yuxin |
Hits:
Description: 《计算机程序设计艺术》重译自Donald E. Knuth(汉名高德纳)的三卷著作： The Art of Computer Programming: 1. Fundamental Algorithms 2. Seminumerical Algorithms 3. Sorting and Searching ；三卷中文名为《基本算法》、《半数值算法》及《排序与查找》。本书内容博大精深，作者因为三卷书获得美国计算机协会1974年图灵奖（该奖被国际公认为计算机科学领域的最高奖项）。-The Art of Computer Programming retranslation Donald e. Knuth (han gartner) three volumes of The book: The Art of Computer Programming: 1. The Fundamental Algorithms 2. The Seminumerical Algorithms 3. The Sorting and Searching Three volumes in Chinese, the basic algorithm, a numerical algorithm and the sorting and searching.And profound content of the book, the author for three books for the computer association in 1974 Turing award (the prize is internationally recognized as the highest award in the field of computer science). Platform: |
Size: 26260480 |
Author:刘烨 |
Hits:
Description: 《计算机程序设计艺术》重译自Donald E. Knuth(汉名高德纳)的三卷著作： The Art of Computer Programming: 1. Fundamental Algorithms 2. Seminumerical Algorithms 3. Sorting and Searching ；三卷中文名为《基本算法》、《半数值算法》及《排序与查找》。本书内容博大精深，作者因为三卷书获得美国计算机协会1974年图灵奖（该奖被国际公认为计算机科学领域的最高奖项）。-The Art of Computer Programming retranslation Donald e. Knuth (han gartner) three volumes of The book: The Art of Computer Programming: 1. The Fundamental Algorithms 2. The Seminumerical Algorithms 3. The Sorting and Searching Three volumes in Chinese, the basic algorithm, a numerical algorithm and the sorting and searching.And profound content of the book, the author for three books for the computer association in 1974 Turing award (the prize is internationally recognized as the highest award in the field of computer science). Platform: |
Size: 16496640 |
Author:刘烨 |
Hits:
Description: 《计算机程序设计艺术》重译自Donald E. Knuth(汉名高德纳)的三卷著作： The Art of Computer Programming: 1. Fundamental Algorithms 2. Seminumerical Algorithms 3. Sorting and Searching ；三卷中文名为《基本算法》、《半数值算法》及《排序与查找》。本书内容博大精深，作者因为三卷书获得美国计算机协会1974年图灵奖（该奖被国际公认为计算机科学领域的最高奖项）。-The Art of Computer Programming retranslation Donald e. Knuth (han gartner) three volumes of The book: The Art of Computer Programming: 1. The Fundamental Algorithms 2. The Seminumerical Algorithms 3. The Sorting and Searching Three volumes in Chinese, the basic algorithm, a numerical algorithm and the sorting and searching.And profound content of the book, the author for three books for the computer association in 1974 Turing award (the prize is internationally recognized as the highest award in the field of computer science). Platform: |
Size: 18129920 |
Author:刘烨 |
Hits:
Description: 一个计算机科学的根本问题是订购的项目清单。这里是过多的解决方案，这个问题被称为排序算法。有些排序算法简单，直观，如冒泡排序。其他的，如堆排序并非如此简单，但产生闪电快速的效果。-One of the fundamental problems of computer science is ordering a list of items. There re a plethora of solutions to this problem, known as sorting algorithms. Some sorting algorithms are simple and intuitive, such as the bubble sort. Others, such as the heap sort are not so simple, but produce lightening-fast results. Platform: |
Size: 2048 |
Author:646589015 |
Hits:
Description: 一篇对低维卡尔曼滤波算法作了几何解释，对卡尔曼滤波有更本质的认识。-Next to a Kalman filter algorithm made geometric interpretation of the Kalman filter has a more fundamental understanding. Platform: |
Size: 32768 |
Author:徐伟 |
Hits:
Description: a fundamental extended kalman filtering algorithm for zero-level users, the details of algorithm structure can be checked the function file-a fundamental extended kalman filtering algorithm for zero-level users, the details of algorithm structure can be checked the function file Platform: |
Size: 1024 |
Author:Gaobo Chen |
Hits:
Description: The zip file consists of 4 ebooks related to nature computation algorithm 1.)Bio-inspired Artificial Intelligent 2.) Fundamental of Natural Computing 3.) An Introduction to GA for Scientists and Engineers 4.) Evolutionary Optimization Algorithm Please feel free to download them Platform: |
Size: 66069504 |
Author:Peter |
Hits:
Search - fundamental of algorithm